Parametric min-cuts analysis in a network
نویسندگان
چکیده
منابع مشابه
analysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولMinimizing Expected Losses in Perturbation Models with Multidimensional Parametric Min-cuts
We consider the problem of learning perturbation-based probabilistic models by computing and differentiating expected losses. This is a challenging computational problem that has traditionally been tackled using Monte Carlo-based methods. In this work, we show how a generalization of parametric min-cuts can be used to address the same problem, achieving higher accuracy and faster performance th...
متن کاملTransductive Structured Classification through Constrained Min-Cuts
We extend the Blum and Chawla (2001) graph min-cut algorithm to structured problems. This extension can alternatively be viewed as a joint inference method over a set of training and test instances where parts of the instances interact through a prespecified associative network. The method has has an efficient approximation through a linear-programming relaxation. On small training data sets, t...
متن کاملGlobal Min-cuts in RNC, and Other Rami cations of a Simple Min-Cut Algorithm
This paper presents a new algorithm for nding global min-cuts in weighted, undirected graphs. One of the strengths of the algorithm is its extreme simplicity. This randomized algorithm can be implemented as a strongly polynomial sequential algorithm with running time ~ O(mn), even if space is restricted to O(n), or can be parallelized as an RNC algorithm which runs in time O(log n) on a CRCW PR...
متن کاملGlobal Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm
This paper presents a new algorithm for nding global min-cuts in weighted, undirected graphs. One of the strengths of the algorithm is its extreme simplicity. This randomized algorithm can be implemented as a strongly polynomial sequential algorithm with running time ~ O(mn 2), even if space is restricted to O(n), or can be parallelized as an RNC algorithm which runs in time O(log 2 n) on a CRC...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00496-1